A category of transition systems and its relations with orthomodular posetsBERNARDINELLO, L; POMELLO, L.Lecture notes in computer science. 1997, pp 139-148, issn 0302-9743, isbn 3-540-63437-1Conference Paper

Decomposition of TrPTL formulasMEYER, R; PETIT, A.Lecture notes in computer science. 1997, pp 418-427, issn 0302-9743, isbn 3-540-63437-1Conference Paper

Distances between languages and reflexivity of relationsCHOFFRUT, C; PIGHIZZINI, G.Lecture notes in computer science. 1997, pp 199-208, issn 0302-9743, isbn 3-540-63437-1Conference Paper

Communication complexity and sequential computationHROMKOVIC, J; SCHNITGER, G.Lecture notes in computer science. 1997, pp 71-84, issn 0302-9743, isbn 3-540-63437-1Conference Paper

Complexity theoretical results on partitioned (nondeterministic) binary decision diagramsBOLLIG, B; WEGENER, I.Lecture notes in computer science. 1997, pp 159-168, issn 0302-9743, isbn 3-540-63437-1Conference Paper

Minimal letter frequency in n-th power-free binary wordsKOLPAKOV, R; KUCHEROV, G.Lecture notes in computer science. 1997, pp 347-357, issn 0302-9743, isbn 3-540-63437-1Conference Paper

On the influence of the state encoding on OBDD-representations of finite state machinesMEINEL, C; THEOBALD, T.Lecture notes in computer science. 1997, pp 408-417, issn 0302-9743, isbn 3-540-63437-1Conference Paper

Relating conflict-free stable transition and event models (extended abstract)KHASIDASHVILI, Z; GLAUERT, J.Lecture notes in computer science. 1997, pp 269-278, issn 0302-9743, isbn 3-540-63437-1Conference Paper

Resolution proofs, exponential bounds, and Kolmogorov complexitySCHÖNING, U.Lecture notes in computer science. 1997, pp 110-116, issn 0302-9743, isbn 3-540-63437-1Conference Paper

Routing with finite speeds of memory and networkSIBEYN, J. F.Lecture notes in computer science. 1997, pp 488-497, issn 0302-9743, isbn 3-540-63437-1Conference Paper

When are two rewrite systems more than none?DERSHOWITZ, N.Lecture notes in computer science. 1997, pp 37-43, issn 0302-9743, isbn 3-540-63437-1Conference Paper

A characterization of abstract families of algebraic power seriesKAMER, G; KUICH, W.Lecture notes in computer science. 1997, pp 327-336, issn 0302-9743, isbn 3-540-63437-1Conference Paper

A hierarchy for (1, +κ)-branching programs with respect to κSAVICKY, P; ZAK, S.Lecture notes in computer science. 1997, pp 478-487, issn 0302-9743, isbn 3-540-63437-1Conference Paper

A topological generalization of propositional linear time temporal logicHEINEMANN, B.Lecture notes in computer science. 1997, pp 289-297, issn 0302-9743, isbn 3-540-63437-1Conference Paper

Invertible linear cellular automata over Z_m : Algorithmic and dynamical aspectsMANZINI, G; MARGARA, L.Lecture notes in computer science. 1997, pp 378-387, issn 0302-9743, isbn 3-540-63437-1Conference Paper

Lower bounds for a proof system with an exponential speed-up over constant-depth frege systems and over polynomial calculusKRAJICEK, J.Lecture notes in computer science. 1997, pp 85-90, issn 0302-9743, isbn 3-540-63437-1Conference Paper

On the generation of trees by hyperedge replacementDREWES, F.Lecture notes in computer science. 1997, pp 229-238, issn 0302-9743, isbn 3-540-63437-1Conference Paper

Optimal algorithms for complete linkage clustering in d dimensionsKRZNARIC, D; LEVCOPOULOS, C.Lecture notes in computer science. 1997, pp 368-377, issn 0302-9743, isbn 3-540-63437-1Conference Paper

Positive applications of lattices to cryptographyDWORK, C.Lecture notes in computer science. 1997, pp 44-51, issn 0302-9743, isbn 3-540-63437-1Conference Paper

Repetitiveness of DOL-languages is decidable in polynomial timeKOBAYASHI, Y; OTTO, F.Lecture notes in computer science. 1997, pp 337-346, issn 0302-9743, isbn 3-540-63437-1Conference Paper

Game semantics for programming languagesABRAMSKY, S.Lecture notes in computer science. 1997, pp 3-4, issn 0302-9743, isbn 3-540-63437-1Conference Paper

Learning to perform Knowledge-intensive inferencesROTH, D.Lecture notes in computer science. 1997, pp 108-109, issn 0302-9743, isbn 3-540-63437-1Conference Paper

Communication complexityBABAI, L.Lecture notes in computer science. 1997, pp 5-18, issn 0302-9743, isbn 3-540-63437-1Conference Paper

Counting problems over the realsMEER, K.Lecture notes in computer science. 1997, pp 398-407, issn 0302-9743, isbn 3-540-63437-1Conference Paper

Dependency-based action refinementRENSINK, A; WEHRHEIM, H.Lecture notes in computer science. 1997, pp 468-477, issn 0302-9743, isbn 3-540-63437-1Conference Paper